| 翻訳と辞書 |
| Least frequently used ： ウィキペディア英語版 |
Least frequently used
Least Frequently Used (LFU) is a type of cache algorithm used to manage memory within a computer. The standard characteristics of this method involve the system keeping track of the number of times a block is referenced in memory. When the cache is full and requires more room the system will purge the item with the lowest reference frequency.
LFU is sometimes combined with a Least Recently Used algorithm and called LRFU.〔Donghee Lee; Jongmoo Choi; Jong-Hun Kim; Noh, S.H.; Sang Lyul Min; Yookun Cho; Chong Sang Kim. (LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies ). IEEE Transactions on Computers〕
==Implementation==
The simplest method to employ an LFU algorithm is to assign a counter to every block that is loaded into the cache. Each time a reference is made to that block the counter is increased by one. When the cache reaches capacity and has a new block waiting to be inserted the system will search for the block with the lowest counter and remove it from the cache.〔Silvano Maffeis. (Cache Management Algorithms for Flexible Filesystems ). ACM SIGMETRICS Performance Evaluation Review, Vol. 21, No. 3〕
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Least frequently used」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|